A novel end-to-end fault detection and localization protocol for wavelength-routed WDM networks
نویسندگان
چکیده
Recently the wavelength division multiplexing (WDM) networks are becoming prevalent for telecommunication networks. However, even a very short disruption of service caused by network faults may lead to high data loss in such networks due to the high date rates, increased wavelength numbers and density. Therefore, the network survivability is critical and has been intensively studied, where fault detection and localization is the vital part but has received disproportional attentions. In this paper we describe and analyze an end-to-end lightpath fault detection scheme in data plane with the fault notification in control plane. The endeavor is focused on reducing the fault detection time. In this protocol, the source node of each lightpath keeps sending hello packets to the destination node exactly following the path for data traffic. The destination node generates an alarm once a certain number of consecutive hello packets are missed within a given time period. Then the network management unit collects all alarms and locates the faulty source based on the network topology, as well as sends fault notification messages via control plane to either the source node or all upstream nodes along the lightpath. The performance evaluation shows such a protocol can achieve fast fault detection, and at the same time, the overhead brought to the user data by hello packets is negligible.
منابع مشابه
Fault Identification using end-to-end data by imperialist competitive algorithm
Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive alg...
متن کاملFault Identification using end-to-end data by imperialist competitive algorithm
Faults in computer networks may result in millions of dollars in cost. Faults in a network need to be localized and repaired to keep the health of the network. Fault management systems are used to keep today’s complex networks running without significant cost, either by using active techniques or passive techniques. In this paper, we propose a novel approach based on imperialist competitive alg...
متن کاملRobust IP Backbone Network Utilizing WDM Optical Paths*
A wavelength division multiplexing (WDM) optical path-based Internet protocol (IP) backbone network is proposed as a cost-effective way of realizing robust IP-over-photonic systems. The WDM optical path is based on WDM transmission and wavelength routing. Between end-to-end IP backbone routers, the WDM optical path, a fat and robust optical pipe, is defined across photonic transport systems (PT...
متن کاملPrediction and Pre-booking for Guaranteed Service Provisioning in Future Wavelength-Division Multiplexing (WDM) Networks
Future Wavelength-Division Multiplexing (WDM) networks should not only support flexible resource-provisioning, but also transport various services with regulated end-to-end delay. In large-scale backbone networks with dynamic lightpath provisioning, the resource reservation overhead is high due to the latencies involved, thus limiting the capability of end-to-end delay guaranteed service provis...
متن کاملAll-Optical Multicast Routing in Wavelength Routed WDM Networks. (Routage multicast tout optique dans les réseaux WDM)
In this thesis, we studied the all-optical multicast routing (AOMR) problem in wavelength-routed WDM networks. The objective is to find a set of light structures, for instance a light-tree or a light-forest, to distribute the multicast messages to all the destinations concurrently while either taking account of both the end-to-end delay and the link stress or minimizing the total cost or the po...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005